Smoothed Aggregation Multigrid for the Discontinuous Galerkin Method
نویسندگان
چکیده
The aim of this paper is to investigate theoretically as well as experimentally an algebraic multilevel algorithm for the solution of the linear systems arising from the discontinuous Galerkin method. The smoothed aggregation multigrid, introduced by Vaněk for the conforming finite element method, is applied to low-order discretizations of convection-diffusion equations. For the elliptic model problem the algorithm is shown to be optimal. Adjustments for the case of nonvanishing advection, such as directionally implicit smoothing and a suitable splitting of the operator are discussed. Several numerical experiments are presented, including a Newton type linearization of the compressible Navier-Stokes equations.
منابع مشابه
Smoothed aggregation multigrid solvers for high-order discontinuous Galerkin methods for elliptic problems
We develop a smoothed aggregation-based algebraic multigrid solver for high-order discontinuous Galerkin discretizations of the Poisson problem. Algebraic multigrid is a popular and effective method for solving the sparse linear systems that arise from discretizing partial differential equations. However, high-order discontinuous Galerkin discretizations have proved challenging for algebraic mu...
متن کاملNon-Galerkin Multigrid Based on Sparsified Smoothed Aggregation
Algebraic Multigrid (AMG) methods are known to be efficient in solving linear systems arising from the discretization of partial differential equations and other related problems. These methods employ a hierarchy of representations of the problem on successively coarser meshes. The coarse-grid operators are usually defined by (Petrov-)Galerkin coarsening, which is a projection of the original o...
متن کاملAlgebraic Multigrid for Discontinuous Galerkin Discretizations
We present a new algebraic multigrid (AMG) algorithm for the solution of linear systems arising from discontinuous Galerkin discretizations of heterogeneous elliptic problems. The algorithm is based on the idea of subspace corrections and the first coarse level space is the subspace spanned by continuous linear basis functions. The linear system associated with this space is constructed algebra...
متن کاملSmoothed aggregation for Helmholtz problems
We outline a smoothed aggregation algebraic multigrid method for 1D and 2D scalar Helmholtz problems with exterior radiation boundary conditions. We consider standard 1D finite difference discretizations and 2D discontinuous Galerkin discretizations. The scalar Helmholtz problem is particularly difficult for algebraic multigrid solvers. Not only can the discrete operator be complex-valued, inde...
متن کاملAnalysis of an Algebraic Petrov-Galerkin Smoothed Aggregation Multigrid Method
We give a convergence estimate for a Petrov-Galerkin Algebraic Multigrid method. In this method, the prolongations are defined using the concept of smoothed aggregation while the restrictions are simple aggregation operators. The analysis is carried out by showing that these methods can be interpreted as variational Ritz-Galerkin ones using modified transfer and smoothing operators. The estimat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 31 شماره
صفحات -
تاریخ انتشار 2009